Algorithms for Complex Shapes with Certified Numerics and Topology A deterministic Bitstream Descartes Algorithm

نویسندگان

  • Kurt Mehlhorn
  • Michael Sagraloff
چکیده

We describe a variant of the Descartes algorithm for root isolation of polynomials with real coefficients. It is assumed that the coefficients of the polynomial can be approximated with arbitrary precision; exact computation in the field of coefficients is not required. We refer to such coefficients as bitstream coefficients. The algorithm is deterministic and has same asymptotic complexity as the randomized bitstream Descartes algorithm of Eigenwillig et. al. [EKK+05]. Besides being deterministic, the algorithm is also somewhat simpler to analyse.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ACS Algorithms for Complex Shapes with Certified Numerics and Topology Cross-benchmarks of univariate algebraic kernels

We summarize the results of the cross-benchmarks for two univariate algebraic kernels (AK) developed in ACS. The kernels, developed at INRIA and MPI, were tested on 6 types of univariate polynomials of various degrees and bitsizes. The methods included were: Sturm, Sleeve, CF, NCF, NCF2 for the INRIA kernel, and Descartes and Bitstream-Descartes for the MPI kernel. NCF, NCF2, Descartes and Bits...

متن کامل

ACS Algorithms for Complex Shapes with Certified Numerics and Topology Anisotropic mesh generation

Project co-funded by the European Commission within FP6 (2002–2006) under contract nr. IST-006413

متن کامل

ACS Algorithms for Complex Shapes with Certified Numerics and Topology Comparison of algorithms for anisotropic meshing and adaptive refinement

In this report, we investigate different approaches for solving the — difficult— problem of anisotropic mesh generation in two dimensions. Among these methods, two seem particularly promising for the extension in three dimensions.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008